Evaluation of Performance of Dispatching Rules for Number of Tardy Jobs and Total Setups
نویسنده
چکیده
Job shop scheduling problems with stochastic processing and sequence-dependent setup times and dynamic arrival of job types are real world and most complex among various scheduling problems. This paper extends the previous work of Sharma and Jain (2015) by assessing the performance of proposed four setups oriented dispatching rules with respect to bench mark dispatching rule taken from literature for number of tardy jobs and total setups measures respectively. Simulation results indicate that the proposed setup oriented dispatching rules provide better performance.
منابع مشابه
Performance analysis of dispatching rules in a stochastic dynamic job shop manufacturing system with sequence-dependent setup times: Simulation approach
Stochastic dynamic job shop scheduling problem with consideration of sequence-dependent setup times are among the most difficult classes of scheduling problems. This paper assesses the performance of nine dispatching rules in such shop from makespan, mean flow time, maximum flow time, mean tardiness, maximum tardiness, number of tardy jobs, total setups and mean setup time performance measures ...
متن کاملA branch and bound algorithm to minimize the total weighted number of tardy jobs and delivery costs with late deliveries for a supply chain scheduling problem
In this paper, we study a supply chain scheduling problem that simultaneously considers production scheduling and product delivery. jobs have to be scheduled on a single machine and delivered to customers for further processing in batches. The objective is to minimize the sum of the total weighted number of tardy jobs and the delivery costs. In this paper, we present a heuristic algorithm (HA...
متن کاملThe effect of inserted idle time on the performance of dispatching rules in a flowshop
Inserted idle time occurs when a machine is kept waiting deliberately for the arrival of a job that is still being processed on a preceding machine. A common assumption in most of the existing literature on flowshop scheduling is that inserted idle time is not allowed, and whenever there are jobs that are ready for processing on a given machine, that machine is not kept idle for any reason. Thi...
متن کاملA procedure to compute a probabilistic bound for the maximum tardiness using stochastic simulation
Dispatching rules are widely used to dynamically schedule the operations in a shop. Their efficiency depends on the performance criteria of interest. One of the most important objectives to deal with in a manufacturing system is the tardiness which can be measured through several performance measures. This paper proposes an effective procedure to estimate the first two central moments (i.e., th...
متن کاملEvaluation of Bi-objective Scheduling Problems by FDH, Distance and Triangle Methods
In this paper, two methods named distance and triangle methods are extended to evaluate the quality of approximation of the Pareto set from solving bi-objective problems. In order to use evaluation methods, a bi-objective problem is needed to define. It is considered the problem of scheduling jobs in a hybrid flow shop environment with sequence-dependent setup times and the objectives of minimi...
متن کامل